Online paging and file caching with expiration times

Online Paging and Caching

Caching with Expiration Times for Internet Applications

Caching data together with expiration times beyond which the data are no longer valid is a standard method for promoting information coherence in distributed systems, including the Internet, the World Wide Web (WWW), and Peer-to-Peer (P2P) networks. We use the framework of competitive analysis of online algorithms and study upper and lower bounds for page eviction strategies in the case where d...

A Uniied Analysis of Paging and Caching

Paging (caching) is the problem of managing a two-level memory hierarchy in order to minimize the time required to process a sequence of memory accesses. In order to measure this quantity, we deene the system parameter miss penalty to represent the extra time required to access slow memory. In the context of paging , miss penalty is large, so most previous studies of on-line paging have implici...

File Caching with Rental Cost and Zapping

The file caching problem is defined as follows. Given a cache of size k (a positive integer), the goal is to minimize the total retrieval cost for the given sequence of requests to files. A file f has size size(f) (a positive integer) and retrieval cost cost(f) (a non-negative number) for bringing the file into the cache. A miss or fault occurs when the requested file is not in the cache and th...

Truly Online Paging with Locality of Reference

The competitive analysis fails to model locality of reference in the online paging problem. To deal with it, Borodin et al. introduced the access graph model, which attempts to capture the locality of reference. However, the access graph model has a number of troubling aspects. The access graph has to be known in advance to the paging algorithm and the memory required to represent the access gr...